#include "Heap2.h"

void test()
{
	BTNode* root = BinaryTreeCreate();
	/*BinaryTreePrevOrder(root);
	printf("\n");
	BinaryTreeInOrder(root);
	printf("\n");
	BinaryTreePostOrder(root);
	printf("\n");
	int n = BinaryTreeSize(root);
	int n1 = BinaryTreeLeafSize(root);
	int n2 = TreeHigh(root);
	printf("%d\n%d\n%d\n", n, n1, n2);
	int n3 = BinaryTreeLevelKSize(root, 3);
	printf("%d\n", n3);
	BTNode* ret = BinaryTreeFind(root, 3);*/
	int ret = BinaryTreeComplete(root);
	printf("%d", ret);
}


int main()
{
	test();

	return 0;
}